<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.8.10"/>
<title>Introduction_to_Algorithms: src/tree_algorithms/binarytreenode/binarytreenode.h Source File</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<link href="navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="resize.js"></script>
<script type="text/javascript" src="navtreedata.js"></script>
<script type="text/javascript" src="navtree.js"></script>
<script type="text/javascript">
  $(document).ready(initResizable);
  $(window).load(resizeHeight);
</script>
<link href="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="search/searchdata.js"></script>
<script type="text/javascript" src="search/search.js"></script>
<script type="text/javascript">
  $(document).ready(function() { init_search(); });
</script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
 <tbody>
 <tr style="height: 56px;">
  <td id="projectalign" style="padding-left: 0.5em;">
   <div id="projectname">Introduction_to_Algorithms
   </div>
  </td>
 </tr>
 </tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.10 -->
<script type="text/javascript">
var searchBox = new SearchBox("searchBox", "search",false,'Search');
</script>
  <div id="navrow1" class="tabs">
    <ul class="tablist">
      <li><a href="index.html"><span>Main&#160;Page</span></a></li>
      <li><a href="namespaces.html"><span>Namespaces</span></a></li>
      <li><a href="annotated.html"><span>Classes</span></a></li>
      <li class="current"><a href="files.html"><span>Files</span></a></li>
      <li>
        <div id="MSearchBox" class="MSearchBoxInactive">
        <span class="left">
          <img id="MSearchSelect" src="search/mag_sel.png"
               onmouseover="return searchBox.OnSearchSelectShow()"
               onmouseout="return searchBox.OnSearchSelectHide()"
               alt=""/>
          <input type="text" id="MSearchField" value="Search" accesskey="S"
               onfocus="searchBox.OnSearchFieldFocus(true)" 
               onblur="searchBox.OnSearchFieldFocus(false)" 
               onkeyup="searchBox.OnSearchFieldChange(event)"/>
          </span><span class="right">
            <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a>
          </span>
        </div>
      </li>
    </ul>
  </div>
  <div id="navrow2" class="tabs2">
    <ul class="tablist">
      <li><a href="files.html"><span>File&#160;List</span></a></li>
      <li><a href="globals.html"><span>File&#160;Members</span></a></li>
    </ul>
  </div>
</div><!-- top -->
<div id="side-nav" class="ui-resizable side-nav-resizable">
  <div id="nav-tree">
    <div id="nav-tree-contents">
      <div id="nav-sync" class="sync"></div>
    </div>
  </div>
  <div id="splitbar" style="-moz-user-select:none;" 
       class="ui-resizable-handle">
  </div>
</div>
<script type="text/javascript">
$(document).ready(function(){initNavTree('binarytreenode_8h_source.html','');});
</script>
<div id="doc-content">
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
     onmouseover="return searchBox.OnSearchSelectShow()"
     onmouseout="return searchBox.OnSearchSelectHide()"
     onkeydown="return searchBox.OnSearchSelectKey(event)">
</div>

<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="javascript:void(0)" frameborder="0" 
        name="MSearchResults" id="MSearchResults">
</iframe>
</div>

<div class="header">
  <div class="headertitle">
<div class="title">binarytreenode.h</div>  </div>
</div><!--header-->
<div class="contents">
<a href="binarytreenode_8h.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno">    1</span>&#160;<span class="comment">/*</span></div>
<div class="line"><a name="l00002"></a><span class="lineno">    2</span>&#160;<span class="comment"> * Copyright 2016- huaxz &lt;huaxz1986@163.com&gt;</span></div>
<div class="line"><a name="l00003"></a><span class="lineno">    3</span>&#160;<span class="comment"> *</span></div>
<div class="line"><a name="l00004"></a><span class="lineno">    4</span>&#160;<span class="comment"> * This program is free software: you can redistribute it and/or modify</span></div>
<div class="line"><a name="l00005"></a><span class="lineno">    5</span>&#160;<span class="comment"> * it under the terms of the GNU General Public License as published by</span></div>
<div class="line"><a name="l00006"></a><span class="lineno">    6</span>&#160;<span class="comment"> * the Free Software Foundation, either version 2 of the License, or</span></div>
<div class="line"><a name="l00007"></a><span class="lineno">    7</span>&#160;<span class="comment"> * (at your option) any later version.</span></div>
<div class="line"><a name="l00008"></a><span class="lineno">    8</span>&#160;<span class="comment"> *</span></div>
<div class="line"><a name="l00009"></a><span class="lineno">    9</span>&#160;<span class="comment"> * This program is distributed in the hope that it will be useful,</span></div>
<div class="line"><a name="l00010"></a><span class="lineno">   10</span>&#160;<span class="comment"> * but WITHOUT ANY WARRANTY; without even the implied warranty of</span></div>
<div class="line"><a name="l00011"></a><span class="lineno">   11</span>&#160;<span class="comment"> * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</span></div>
<div class="line"><a name="l00012"></a><span class="lineno">   12</span>&#160;<span class="comment"> * GNU General Public License for more details.</span></div>
<div class="line"><a name="l00013"></a><span class="lineno">   13</span>&#160;<span class="comment"> *</span></div>
<div class="line"><a name="l00014"></a><span class="lineno">   14</span>&#160;<span class="comment"> * You should have received a copy of the GNU General Public License</span></div>
<div class="line"><a name="l00015"></a><span class="lineno">   15</span>&#160;<span class="comment"> * along with this program.  If not, see &lt;http://www.gnu.org/licenses/&gt;.</span></div>
<div class="line"><a name="l00016"></a><span class="lineno">   16</span>&#160;<span class="comment"> *</span></div>
<div class="line"><a name="l00017"></a><span class="lineno">   17</span>&#160;<span class="comment"> * Author: huaxz1986@163.com (huaxz)</span></div>
<div class="line"><a name="l00018"></a><span class="lineno">   18</span>&#160;<span class="comment"> */</span></div>
<div class="line"><a name="l00019"></a><span class="lineno">   19</span>&#160;<span class="preprocessor">#ifndef BINARYTREENODE</span></div>
<div class="line"><a name="l00020"></a><span class="lineno">   20</span>&#160;<span class="preprocessor">#define BINARYTREENODE</span></div>
<div class="line"><a name="l00021"></a><span class="lineno">   21</span>&#160;<span class="preprocessor">#include&lt;memory&gt;</span></div>
<div class="line"><a name="l00022"></a><span class="lineno">   22</span>&#160;<span class="preprocessor">#include&lt;string&gt;</span></div>
<div class="line"><a name="l00023"></a><span class="lineno">   23</span>&#160;<span class="preprocessor">#include&lt;sstream&gt;</span></div>
<div class="line"><a name="l00024"></a><span class="lineno">   24</span>&#160;<span class="keyword">namespace </span><a class="code" href="namespace_introduction_to_algorithm.html">IntroductionToAlgorithm</a> {</div>
<div class="line"><a name="l00025"></a><span class="lineno">   25</span>&#160;<span class="keyword">namespace </span>TreeAlgorithm {</div>
<div class="line"><a name="l00027"></a><span class="lineno">   27</span>&#160;</div>
<div class="line"><a name="l00031"></a><span class="lineno"><a class="line" href="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree_node.html">   31</a></span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">typename</span> KType&gt; <span class="keyword">struct </span><a class="code" href="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree_node.html">BinaryTreeNode</a></div>
<div class="line"><a name="l00032"></a><span class="lineno">   32</span>&#160;{</div>
<div class="line"><a name="l00033"></a><span class="lineno">   33</span>&#160;<span class="keyword">public</span>:</div>
<div class="line"><a name="l00034"></a><span class="lineno"><a class="line" href="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree_node.html#adbd8539e7a907c3a8fe7a8b79e7032e8">   34</a></span>&#160;    <span class="keyword">typedef</span> KType <a class="code" href="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree_node.html#adbd8539e7a907c3a8fe7a8b79e7032e8">KeyType</a>;  </div>
<div class="line"><a name="l00035"></a><span class="lineno">   35</span>&#160;</div>
<div class="line"><a name="l00039"></a><span class="lineno"><a class="line" href="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree_node.html#a8e8de673785852b0c091916f5fb64e78">   39</a></span>&#160;    <a class="code" href="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree_node.html#a8e8de673785852b0c091916f5fb64e78">BinaryTreeNode</a>()</div>
<div class="line"><a name="l00040"></a><span class="lineno">   40</span>&#160;        :<a class="code" href="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree_node.html#aa94cbc785416ba74505661baac55a9fd">parent</a>(std::weak_ptr&lt;<a class="code" href="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree_node.html">BinaryTreeNode</a>&gt;()),<a class="code" href="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree_node.html#a3e056b1d34820497ac3a23a16180be2b">lchild</a>(std::shared_ptr&lt;<a class="code" href="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree_node.html">BinaryTreeNode</a>&gt;()),<a class="code" href="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree_node.html#aaccc444db582ed362bff4e50efbc47c7">rchild</a>(std::shared_ptr&lt;<a class="code" href="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree_node.html">BinaryTreeNode</a>&gt;()),<a class="code" href="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree_node.html#af3cb8030ab05ccaf1a69a86c9f468b8d">key</a>(KeyType())</div>
<div class="line"><a name="l00041"></a><span class="lineno">   41</span>&#160;    {}</div>
<div class="line"><a name="l00043"></a><span class="lineno">   43</span>&#160;</div>
<div class="line"><a name="l00048"></a><span class="lineno"><a class="line" href="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree_node.html#a8382a5ddc6f9c8cbfeacd0f0163d8c4d">   48</a></span>&#160;    <span class="keyword">explicit</span> <a class="code" href="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree_node.html#a8382a5ddc6f9c8cbfeacd0f0163d8c4d">BinaryTreeNode</a>(<span class="keyword">const</span> KeyType&amp; keyvalue)</div>
<div class="line"><a name="l00049"></a><span class="lineno">   49</span>&#160;        :<a class="code" href="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree_node.html#aa94cbc785416ba74505661baac55a9fd">parent</a>(std::weak_ptr&lt;<a class="code" href="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree_node.html">BinaryTreeNode</a>&gt;()),<a class="code" href="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree_node.html#a3e056b1d34820497ac3a23a16180be2b">lchild</a>(std::shared_ptr&lt;<a class="code" href="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree_node.html">BinaryTreeNode</a>&gt;()),<a class="code" href="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree_node.html#aaccc444db582ed362bff4e50efbc47c7">rchild</a>(std::shared_ptr&lt;<a class="code" href="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree_node.html">BinaryTreeNode</a>&gt;()),<a class="code" href="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree_node.html#af3cb8030ab05ccaf1a69a86c9f468b8d">key</a>(keyvalue)</div>
<div class="line"><a name="l00050"></a><span class="lineno">   50</span>&#160;    {}</div>
<div class="line"><a name="l00051"></a><span class="lineno">   51</span>&#160;</div>
<div class="line"><a name="l00053"></a><span class="lineno">   53</span>&#160;</div>
<div class="line"><a name="l00058"></a><span class="lineno"><a class="line" href="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree_node.html#ae552fb23243e499a60ef73375fabe239">   58</a></span>&#160;    <span class="keyword">virtual</span> std::string <a class="code" href="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree_node.html#ae552fb23243e499a60ef73375fabe239">to_string</a>(){</div>
<div class="line"><a name="l00059"></a><span class="lineno">   59</span>&#160;        std::ostringstream os;</div>
<div class="line"><a name="l00060"></a><span class="lineno">   60</span>&#160;        os&lt;&lt;<span class="stringliteral">&quot;node:&quot;</span>&lt;&lt;<a class="code" href="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree_node.html#af3cb8030ab05ccaf1a69a86c9f468b8d">key</a>;</div>
<div class="line"><a name="l00061"></a><span class="lineno">   61</span>&#160;        <span class="keywordflow">if</span>(<span class="keyword">auto</span> shared_p=<a class="code" href="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree_node.html#aa94cbc785416ba74505661baac55a9fd">parent</a>.lock()) os&lt;&lt;<span class="stringliteral">&quot;\n\t parent:&quot;</span>&lt;&lt;shared_p-&gt;key;</div>
<div class="line"><a name="l00062"></a><span class="lineno">   62</span>&#160;        <span class="keywordflow">else</span> os&lt;&lt;<span class="stringliteral">&quot;\n\t parent:&quot;</span>&lt;&lt;<span class="stringliteral">&quot;null_ptr&quot;</span>;</div>
<div class="line"><a name="l00063"></a><span class="lineno">   63</span>&#160;</div>
<div class="line"><a name="l00064"></a><span class="lineno">   64</span>&#160;        os&lt;&lt;<span class="stringliteral">&quot;\n\t left_child:&quot;</span>;</div>
<div class="line"><a name="l00065"></a><span class="lineno">   65</span>&#160;        <span class="keywordflow">if</span>(<a class="code" href="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree_node.html#a3e056b1d34820497ac3a23a16180be2b">lchild</a>)  os&lt;&lt;<a class="code" href="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree_node.html#a3e056b1d34820497ac3a23a16180be2b">lchild</a>-&gt;key;</div>
<div class="line"><a name="l00066"></a><span class="lineno">   66</span>&#160;        <span class="keywordflow">else</span>   os&lt;&lt;<span class="stringliteral">&quot;nullptr&quot;</span>;</div>
<div class="line"><a name="l00067"></a><span class="lineno">   67</span>&#160;</div>
<div class="line"><a name="l00068"></a><span class="lineno">   68</span>&#160;        os&lt;&lt;<span class="stringliteral">&quot;\n\t right_child:&quot;</span>;</div>
<div class="line"><a name="l00069"></a><span class="lineno">   69</span>&#160;        <span class="keywordflow">if</span>(<a class="code" href="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree_node.html#aaccc444db582ed362bff4e50efbc47c7">rchild</a>) os&lt;&lt;<a class="code" href="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree_node.html#aaccc444db582ed362bff4e50efbc47c7">rchild</a>-&gt;key;</div>
<div class="line"><a name="l00070"></a><span class="lineno">   70</span>&#160;        <span class="keywordflow">else</span> os&lt;&lt;<span class="stringliteral">&quot;nullptr&quot;</span>;</div>
<div class="line"><a name="l00071"></a><span class="lineno">   71</span>&#160;        <span class="keywordflow">return</span> os.str();</div>
<div class="line"><a name="l00072"></a><span class="lineno">   72</span>&#160;    }</div>
<div class="line"><a name="l00074"></a><span class="lineno">   74</span>&#160;</div>
<div class="line"><a name="l00079"></a><span class="lineno"><a class="line" href="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree_node.html#a694d14f0b33f2f052f11148ecbe1684e">   79</a></span>&#160;    <span class="keyword">virtual</span> std::string <a class="code" href="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree_node.html#a694d14f0b33f2f052f11148ecbe1684e">to_xml</a>(){</div>
<div class="line"><a name="l00080"></a><span class="lineno">   80</span>&#160;        std::ostringstream os;</div>
<div class="line"><a name="l00081"></a><span class="lineno">   81</span>&#160;        os&lt;&lt;<span class="stringliteral">&quot;\n&lt;node&gt;&quot;</span>&lt;&lt;<a class="code" href="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree_node.html#af3cb8030ab05ccaf1a69a86c9f468b8d">key</a>&lt;&lt;<span class="stringliteral">&quot;\n&quot;</span>;</div>
<div class="line"><a name="l00082"></a><span class="lineno">   82</span>&#160;        <span class="keywordflow">if</span>(<span class="keyword">auto</span> shared_p=<a class="code" href="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree_node.html#aa94cbc785416ba74505661baac55a9fd">parent</a>.lock())</div>
<div class="line"><a name="l00083"></a><span class="lineno">   83</span>&#160;        {</div>
<div class="line"><a name="l00084"></a><span class="lineno">   84</span>&#160;            os&lt;&lt;<span class="stringliteral">&quot;\t &lt;parent&gt;&quot;</span>&lt;&lt;shared_p-&gt;key&lt;&lt;<span class="stringliteral">&quot;&lt;/parent&gt;&quot;</span>;</div>
<div class="line"><a name="l00085"></a><span class="lineno">   85</span>&#160;        }<span class="keywordflow">else</span></div>
<div class="line"><a name="l00086"></a><span class="lineno">   86</span>&#160;        {</div>
<div class="line"><a name="l00087"></a><span class="lineno">   87</span>&#160;            os&lt;&lt;<span class="stringliteral">&quot;\t &lt;parent&gt;&quot;</span>&lt;&lt;<span class="stringliteral">&quot;null_ptr&quot;</span>&lt;&lt;<span class="stringliteral">&quot;&lt;/parent&gt;&quot;</span>;</div>
<div class="line"><a name="l00088"></a><span class="lineno">   88</span>&#160;        }</div>
<div class="line"><a name="l00089"></a><span class="lineno">   89</span>&#160;        os&lt;&lt;<span class="stringliteral">&quot;\n\t &lt;left_child&gt;&quot;</span>&lt;&lt;(<a class="code" href="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree_node.html#a3e056b1d34820497ac3a23a16180be2b">lchild</a>? <a class="code" href="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree_node.html#a3e056b1d34820497ac3a23a16180be2b">lchild</a>-&gt;to_xml(): <span class="stringliteral">&quot;nullptr&quot;</span>)&lt;&lt;<span class="stringliteral">&quot;&lt;/left_child&gt;&quot;</span>\</div>
<div class="line"><a name="l00090"></a><span class="lineno">   90</span>&#160;          &lt;&lt;<span class="stringliteral">&quot;\n\t&lt;right_child&gt;&quot;</span>&lt;&lt;(<a class="code" href="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree_node.html#aaccc444db582ed362bff4e50efbc47c7">rchild</a>? <a class="code" href="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree_node.html#aaccc444db582ed362bff4e50efbc47c7">rchild</a>-&gt;to_xml():<span class="stringliteral">&quot;nullptr&quot;</span>)&lt;&lt;<span class="stringliteral">&quot;&lt;/right_child&gt;&quot;</span>\</div>
<div class="line"><a name="l00091"></a><span class="lineno">   91</span>&#160;          &lt;&lt;<span class="stringliteral">&quot;\n&lt;/node&gt;&quot;</span>;</div>
<div class="line"><a name="l00092"></a><span class="lineno">   92</span>&#160;        <span class="keywordflow">return</span> os.str();</div>
<div class="line"><a name="l00093"></a><span class="lineno">   93</span>&#160;    }</div>
<div class="line"><a name="l00095"></a><span class="lineno">   95</span>&#160;</div>
<div class="line"><a name="l00099"></a><span class="lineno"><a class="line" href="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree_node.html#a54a90606ceb604a1a4d01056429a8a06">   99</a></span>&#160;    <span class="keywordtype">bool</span> <a class="code" href="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree_node.html#a54a90606ceb604a1a4d01056429a8a06">is_left_child</a>()</div>
<div class="line"><a name="l00100"></a><span class="lineno">  100</span>&#160;    {</div>
<div class="line"><a name="l00101"></a><span class="lineno">  101</span>&#160;       <span class="keywordflow">if</span> (<span class="keyword">auto</span> shared_p = <a class="code" href="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree_node.html#aa94cbc785416ba74505661baac55a9fd">parent</a>.lock())</div>
<div class="line"><a name="l00102"></a><span class="lineno">  102</span>&#160;       {</div>
<div class="line"><a name="l00103"></a><span class="lineno">  103</span>&#160;            <span class="keywordflow">if</span> (<span class="keyword">this</span>==shared_p-&gt;lchild.get())</div>
<div class="line"><a name="l00104"></a><span class="lineno">  104</span>&#160;                <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><a name="l00105"></a><span class="lineno">  105</span>&#160;       }</div>
<div class="line"><a name="l00106"></a><span class="lineno">  106</span>&#160;       <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a name="l00107"></a><span class="lineno">  107</span>&#160;    }</div>
<div class="line"><a name="l00109"></a><span class="lineno">  109</span>&#160;</div>
<div class="line"><a name="l00113"></a><span class="lineno"><a class="line" href="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree_node.html#a34c1912a2a7e9caa7a67354218fd7640">  113</a></span>&#160;    <span class="keywordtype">bool</span> <a class="code" href="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree_node.html#a34c1912a2a7e9caa7a67354218fd7640">is_right_child</a>()</div>
<div class="line"><a name="l00114"></a><span class="lineno">  114</span>&#160;    {</div>
<div class="line"><a name="l00115"></a><span class="lineno">  115</span>&#160;       <span class="keywordflow">if</span> (<span class="keyword">auto</span> shared_p = <a class="code" href="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree_node.html#aa94cbc785416ba74505661baac55a9fd">parent</a>.lock())</div>
<div class="line"><a name="l00116"></a><span class="lineno">  116</span>&#160;       {</div>
<div class="line"><a name="l00117"></a><span class="lineno">  117</span>&#160;            <span class="keywordflow">if</span> (<span class="keyword">this</span>==shared_p-&gt;rchild.get())</div>
<div class="line"><a name="l00118"></a><span class="lineno">  118</span>&#160;                <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><a name="l00119"></a><span class="lineno">  119</span>&#160;       }</div>
<div class="line"><a name="l00120"></a><span class="lineno">  120</span>&#160;       <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a name="l00121"></a><span class="lineno">  121</span>&#160;    }</div>
<div class="line"><a name="l00122"></a><span class="lineno"><a class="line" href="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree_node.html#aa94cbc785416ba74505661baac55a9fd">  122</a></span>&#160;    std::weak_ptr&lt;BinaryTreeNode&gt; <a class="code" href="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree_node.html#aa94cbc785416ba74505661baac55a9fd">parent</a>;   </div>
<div class="line"><a name="l00123"></a><span class="lineno"><a class="line" href="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree_node.html#a3e056b1d34820497ac3a23a16180be2b">  123</a></span>&#160;    std::shared_ptr&lt;BinaryTreeNode&gt; <a class="code" href="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree_node.html#a3e056b1d34820497ac3a23a16180be2b">lchild</a>; </div>
<div class="line"><a name="l00124"></a><span class="lineno"><a class="line" href="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree_node.html#aaccc444db582ed362bff4e50efbc47c7">  124</a></span>&#160;    std::shared_ptr&lt;BinaryTreeNode&gt; <a class="code" href="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree_node.html#aaccc444db582ed362bff4e50efbc47c7">rchild</a>; </div>
<div class="line"><a name="l00125"></a><span class="lineno"><a class="line" href="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree_node.html#af3cb8030ab05ccaf1a69a86c9f468b8d">  125</a></span>&#160;    KeyType <a class="code" href="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree_node.html#af3cb8030ab05ccaf1a69a86c9f468b8d">key</a>;                                 </div>
<div class="line"><a name="l00126"></a><span class="lineno">  126</span>&#160;};</div>
<div class="line"><a name="l00127"></a><span class="lineno">  127</span>&#160;}</div>
<div class="line"><a name="l00128"></a><span class="lineno">  128</span>&#160;}</div>
<div class="line"><a name="l00129"></a><span class="lineno">  129</span>&#160;</div>
<div class="line"><a name="l00130"></a><span class="lineno">  130</span>&#160;<span class="preprocessor">#endif // BINARYTREENODE</span></div>
<div class="line"><a name="l00131"></a><span class="lineno">  131</span>&#160;</div>
<div class="ttc" id="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree_node_html_a54a90606ceb604a1a4d01056429a8a06"><div class="ttname"><a href="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree_node.html#a54a90606ceb604a1a4d01056429a8a06">IntroductionToAlgorithm::TreeAlgorithm::BinaryTreeNode::is_left_child</a></div><div class="ttdeci">bool is_left_child()</div><div class="ttdoc">is_left_child:判断本节点是否左子节点。 </div><div class="ttdef"><b>Definition:</b> <a href="binarytreenode_8h_source.html#l00099">binarytreenode.h:99</a></div></div>
<div class="ttc" id="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree_node_html_aa94cbc785416ba74505661baac55a9fd"><div class="ttname"><a href="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree_node.html#aa94cbc785416ba74505661baac55a9fd">IntroductionToAlgorithm::TreeAlgorithm::BinaryTreeNode::parent</a></div><div class="ttdeci">std::weak_ptr&lt; BinaryTreeNode &gt; parent</div><div class="ttdef"><b>Definition:</b> <a href="binarytreenode_8h_source.html#l00122">binarytreenode.h:122</a></div></div>
<div class="ttc" id="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree_node_html_adbd8539e7a907c3a8fe7a8b79e7032e8"><div class="ttname"><a href="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree_node.html#adbd8539e7a907c3a8fe7a8b79e7032e8">IntroductionToAlgorithm::TreeAlgorithm::BinaryTreeNode::KeyType</a></div><div class="ttdeci">KType KeyType</div><div class="ttdef"><b>Definition:</b> <a href="binarytreenode_8h_source.html#l00034">binarytreenode.h:34</a></div></div>
<div class="ttc" id="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree_node_html"><div class="ttname"><a href="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree_node.html">IntroductionToAlgorithm::TreeAlgorithm::BinaryTreeNode</a></div><div class="ttdoc">BinaryTreeNode：二叉树的节点，算法导论xx章xx节 </div><div class="ttdef"><b>Definition:</b> <a href="binarytreenode_8h_source.html#l00031">binarytreenode.h:31</a></div></div>
<div class="ttc" id="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree_node_html_a694d14f0b33f2f052f11148ecbe1684e"><div class="ttname"><a href="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree_node.html#a694d14f0b33f2f052f11148ecbe1684e">IntroductionToAlgorithm::TreeAlgorithm::BinaryTreeNode::to_xml</a></div><div class="ttdeci">virtual std::string to_xml()</div><div class="ttdoc">to_xml:返回以该节点为根的子树的xml描述。 </div><div class="ttdef"><b>Definition:</b> <a href="binarytreenode_8h_source.html#l00079">binarytreenode.h:79</a></div></div>
<div class="ttc" id="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree_node_html_ae552fb23243e499a60ef73375fabe239"><div class="ttname"><a href="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree_node.html#ae552fb23243e499a60ef73375fabe239">IntroductionToAlgorithm::TreeAlgorithm::BinaryTreeNode::to_string</a></div><div class="ttdeci">virtual std::string to_string()</div><div class="ttdoc">to_string:返回该节点的字符串描述 </div><div class="ttdef"><b>Definition:</b> <a href="binarytreenode_8h_source.html#l00058">binarytreenode.h:58</a></div></div>
<div class="ttc" id="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree_node_html_af3cb8030ab05ccaf1a69a86c9f468b8d"><div class="ttname"><a href="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree_node.html#af3cb8030ab05ccaf1a69a86c9f468b8d">IntroductionToAlgorithm::TreeAlgorithm::BinaryTreeNode::key</a></div><div class="ttdeci">KeyType key</div><div class="ttdef"><b>Definition:</b> <a href="binarytreenode_8h_source.html#l00125">binarytreenode.h:125</a></div></div>
<div class="ttc" id="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree_node_html_aaccc444db582ed362bff4e50efbc47c7"><div class="ttname"><a href="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree_node.html#aaccc444db582ed362bff4e50efbc47c7">IntroductionToAlgorithm::TreeAlgorithm::BinaryTreeNode::rchild</a></div><div class="ttdeci">std::shared_ptr&lt; BinaryTreeNode &gt; rchild</div><div class="ttdef"><b>Definition:</b> <a href="binarytreenode_8h_source.html#l00124">binarytreenode.h:124</a></div></div>
<div class="ttc" id="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree_node_html_a8382a5ddc6f9c8cbfeacd0f0163d8c4d"><div class="ttname"><a href="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree_node.html#a8382a5ddc6f9c8cbfeacd0f0163d8c4d">IntroductionToAlgorithm::TreeAlgorithm::BinaryTreeNode::BinaryTreeNode</a></div><div class="ttdeci">BinaryTreeNode(const KeyType &amp;keyvalue)</div><div class="ttdoc">显式构造函数 </div><div class="ttdef"><b>Definition:</b> <a href="binarytreenode_8h_source.html#l00048">binarytreenode.h:48</a></div></div>
<div class="ttc" id="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree_node_html_a34c1912a2a7e9caa7a67354218fd7640"><div class="ttname"><a href="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree_node.html#a34c1912a2a7e9caa7a67354218fd7640">IntroductionToAlgorithm::TreeAlgorithm::BinaryTreeNode::is_right_child</a></div><div class="ttdeci">bool is_right_child()</div><div class="ttdoc">is_right_child:判断本节点是否右子节点。 </div><div class="ttdef"><b>Definition:</b> <a href="binarytreenode_8h_source.html#l00113">binarytreenode.h:113</a></div></div>
<div class="ttc" id="namespace_introduction_to_algorithm_html"><div class="ttname"><a href="namespace_introduction_to_algorithm.html">IntroductionToAlgorithm</a></div><div class="ttdoc">Namespace of IntrodunctionToAlgorithm. </div><div class="ttdef"><b>Definition:</b> <a href="longest__common__subsequence_8h_source.html#l00024">longest_common_subsequence.h:24</a></div></div>
<div class="ttc" id="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree_node_html_a8e8de673785852b0c091916f5fb64e78"><div class="ttname"><a href="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree_node.html#a8e8de673785852b0c091916f5fb64e78">IntroductionToAlgorithm::TreeAlgorithm::BinaryTreeNode::BinaryTreeNode</a></div><div class="ttdeci">BinaryTreeNode()</div><div class="ttdoc">默认构造函数 </div><div class="ttdef"><b>Definition:</b> <a href="binarytreenode_8h_source.html#l00039">binarytreenode.h:39</a></div></div>
<div class="ttc" id="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree_node_html_a3e056b1d34820497ac3a23a16180be2b"><div class="ttname"><a href="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree_node.html#a3e056b1d34820497ac3a23a16180be2b">IntroductionToAlgorithm::TreeAlgorithm::BinaryTreeNode::lchild</a></div><div class="ttdeci">std::shared_ptr&lt; BinaryTreeNode &gt; lchild</div><div class="ttdef"><b>Definition:</b> <a href="binarytreenode_8h_source.html#l00123">binarytreenode.h:123</a></div></div>
</div><!-- fragment --></div><!-- contents -->
</div><!-- doc-content -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
  <ul>
    <li class="navelem"><a class="el" href="dir_8ed9dba4cd616b67da9b1338594e34e0.html">src</a></li><li class="navelem"><a class="el" href="dir_2a06141a7764b24a0bfc3200068bd811.html">tree_algorithms</a></li><li class="navelem"><a class="el" href="dir_1ca586a118e1b1bd1c74ce574da9dceb.html">binarytreenode</a></li><li class="navelem"><a class="el" href="binarytreenode_8h.html">binarytreenode.h</a></li>
    <li class="footer">Generated by
    <a href="http://www.doxygen.org/index.html">
    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.10 </li>
  </ul>
</div>
</body>
</html>
